Solving truck-cargo matching for drop-and-pull transport with genetic algorithm based on demand-capacity fitness
نویسندگان
چکیده
منابع مشابه
genetic algorithm based on explicit memory for solving dynamic problems
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولCargo Capacity Management with Allotments and Spot Market Demand
We consider a problem faced by an airline that operates a number of parallel flights to transport cargo between a particular origin to destination pair. The airline can sell its cargo capacity either through allotment contracts or on the spot market, where customers exhibit choice behavior between different flights. The goal is to simultaneously select allotment contracts among available bids a...
متن کاملGenetic Algorithm Approach for Solving Truck Scheduling Problem with Time Robustness
Problem considered in this paper regards inbound truck to dock door assignments in a cross-dock terminals with temporal constraints included in decision process. Because of stochastic nature of terminal related activities, modifications of already established operational plans are relatively frequent. These disturbances are mainly induced by inaccurate assessment of inbound trucks’ arriving tim...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Alexandria Engineering Journal
سال: 2021
ISSN: 1110-0168
DOI: 10.1016/j.aej.2020.05.015